Using A* algorithm to find shortest path in Indoor positioning system

Now a days, deducing position and route has become crucial because it helps user to get the destination more quickly and easier. Due to complex structure of buildings and infrastructure like areas, to get the exact location of any entity has become difficult. Therefore, Indoor positioning and navigation system, plays vital role for obtaining position (location) for indoor areas. In order to reach to the destination, knowing only position is not enough because there are a lots of rooms inside building, for example, hotels and malls. Thus knowing the route to the destination is also very important so that user can reach the destination in lesser time easily. This paper is divided into two section, the first section consists the general working of A* algorithm and second section shows that how A* is better than Dijkstra’s algorithm.